Department of Statistics STATISTICS COLLOQUIUM

نویسنده

  • PAUL BRESSLOFF
چکیده

Random search strategies occur throughout nature as a means of efficiently searching large areas for one or more targets of unknown location, which can only be detected when the searcher is within a certain range. Examples include animals foraging for food or shelter, the motor-driven transport and delivery of macromolecules to particular compartments within cells, and a promoter protein searching for a specific target site on DNA. One particular class of model, which can be applied both to foraging animals and active transport in cells, treats a random searcher as a particle that switches between a slow motion (diffusive) or stationary phase in which target detection can occur and a fast motion “ballistic” phase; transitions between bulk movement states and searching states are governed by a Markov process. In this talk we review recent work on the analysis of random intermittent search models of motor-driven transport in the dendrites of neurons. The stochastic search process is modeled in terms of a system of Chapman-Kolmogorov equations, which are reduced to a scalar FokkerPlanck equation using perturbation methods. The reduced FP equation is used to compute various quantities that characterise the efficiency of the search process, including the mean first passage time (MFPT) to target detection. We then consider a number of applications. First, we analyze the effects of dendritic branching on the efficiency of motor-driven transport and show that bidirectional rather than unidirectional transport is more effective. Second, we analyze a biophysical model of bidirectional transport, in which opposing motors compete in a “tug-of-war,” and use this to explore how local signaling mechanisms could regulate the delivery of molecular cargo to subcellular targets such as synapses. We end by discussing extensions to higher dimensional searches and models of multiple searchers. For further information and inquiries about building access for persons with disabilities, please contact Dan Moreau at 773.702.8333 or send him an email at [email protected]. If you wish to subscribe to our email list, please visit the following website: https://lists.uchicago.edu/web/arc/statseminars.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithmic Minimal Sufficient Statistics: a New Definition

We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose another definition, which has better properties.

متن کامل

The Department of Statistics & Actuarial Science COLLOQUIUM - SPRING 2015 Professor Annie Title

Weak signal identification and inference are very important in the area of penalized model selection, yet they are under-developed and not well-studied. Existing inference procedures for penalized estimators are mainly focused on strong signals. In this paper, we propose an identification procedure for weak signals in finite samples, and provide a transition phase in-between noise and strong si...

متن کامل

Prospectus 3 i LINKAGE OF MULTISCALE MULTISOURCE MULTI-TIER DATA FOR THE PURPOSES OF REGIONAL ASSESSMENTS AND MONITORING A Research and Outreach Prospectus of Advanced Mathematical, Statistical, and Computational Approaches

G. P. Patil, Mathematical and Environmental Geospatial Statistics and Analysis Department of Statistics, The Pennsylvania State University W. L. Myers, Remote Sensing, Natural Resources, and Software School of Forest Resources, The Pennsylvania State University C. Taillie, Computational Statistics and Stochastics Department of Statistics, The Pennsylvania State University Stephen Rathbun, Depar...

متن کامل

COLLOQUIUM Department of Statistics and Probability Michigan State University

The basic message of this talk could have been delivered a long ago, may be even soon after the time of publication of classical papers of K. Pearson (1900) and R. A. Fisher (1922, 1924). However, the tradition of using the chi-square goodness of fit statistic became so widely spread, and the point of view that, for the case of discrete distributions, statistics “have to” have their asymptotic ...

متن کامل

Correlate: User guide and technical document

∗Department of Statistics, Harvard University, Cambridge MA 02138. Email: [email protected]. †Department of Statistics and Department of Health Research & Policy, Stanford University, Stanford CA 94305. Email: [email protected]. ‡Department of Health Research & Policy and Department of Statistics, Stanford University, Stanford CA 94305. Email: [email protected]. §Department of ...

متن کامل

Distributions of exceedances of generalized order statistics

Statistics A Journal of Theoretical and Applied Statistics Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713682269 Distributions of exceedances of generalized order statistics Ismihan Bairamov a; Halil Tanil b a Department of Mathematics Izmir, University of Economics, Izmir, Turkey b Department of Statistic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013